Study on One-Dimensional Wood Board Cutting Stock Problem Based on Adaptive Genetic Algorithm
نویسندگان
چکیده
منابع مشابه
Study on One-Dimensional Wood Board Cutting Stock Problem Based on Adaptive Genetic Algorithm
When making wood board production, defects on board will influence the machining process automation degree. Therefore, how to fast, accurately remove of wood defects and realize optimal combination cutting stock problem has always been a research hotspot in the field of wood processing. According to the decayed wood board, the paper designed the one dimensional optimization cutting stock combin...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملan aco algorithm for one-dimensional cutting stock problem
the one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. in this paper a meta-heuristic method based on aco is presented to solve this problem. in this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملA Genetic Symbiotic Algorithm Applied to the One-dimensional Cutting Stock Problem
This work presents a genetic symbiotic algorithm to minimize the number of objects and the setup in a one-dimensional cutting stock problem. The algorithm implemented can generate combinations of ordered lengths of stock (the cutting pattern) and, at the same time, the frequency of the cutting patterns, through a symbiotic process between two distinct populations, solutions and cutting patterns...
متن کاملA Genetic Algorithm for the One-dimensional Cutting Stock Problem with Setups
This paper investigates the one-dimensional cutting stock problem considering two conflicting objective functions: minimization of both the number of objects and the number of different cutting patterns used. A new heuristic method based on the concepts of genetic algorithms is proposed to solve the problem. This heuristic is empirically analyzed by solving randomly generated instances and also...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Future Generation Communication and Networking
سال: 2016
ISSN: 2233-7857,2233-7857
DOI: 10.14257/ijfgcn.2016.9.4.09